/*
 * @lc app=leetcode id=112 lang=cpp
 *
 * [112] Path Sum
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {

        if (!root) {
            return false;
        }

        if (!root->left && !root->right) {
            return sum == root->val;
        }

        sum = sum - root->val;
        return hasPathSum(root->left, sum) || hasPathSum(root->right, sum);
    }

};

